PA-LIRS: An Adaptive Page Replacement Algorithm for NAND Flash Memory
نویسندگان
چکیده
منابع مشابه
Page Replacement Algorithm for NAND Flash Used in Mobile Devices
In modern society, intelligent devices equipped with flash memory are very popular. It has many wonderful characteristics, such as small, fast, little consumption, shock resistance and so on. Flash memory is divided into NOR memory and NAND memory. The NOR memory can be quickly read with byte data which is developed into data memory for code storage. A new algorithm is needed to optimize the pe...
متن کاملPage Replacement for Write References in NAND Flash Based Virtual Memory Systems
Contemporary embedded systems often use NAND flash memory instead of hard disks as their swap space of virtual memory. Since the read/write characteristics of NAND flash memory are very different from those of hard disks, an efficient page replacement algorithm is needed for this environment. Our analysis shows that temporal locality is dominant in virtual memory references but that is not the ...
متن کاملPolar-Coded Forward Error Correction for MLC NAND Flash Memory Polar FEC for NAND Flash Memory
With the ever-growing storage density, high-speed, and low-cost data access, flash memory has inevitably become popular. Multi-level cell (MLC) NAND flash memory, which can well balance the data density and memory stability, has occupied the largest market share of flash memory. With the aggressive memory scaling, however, the reliability decays sharply owing to multiple interferences. Therefor...
متن کاملPage overwriting method for performance improvement of NAND flash memories
This paper presents a novel page overwriting scheme for NAND flash memory. It provides significantly improved in-place page update with minimum hardware overhead. It does not require valid page copy for erase operation in order to modify data in a written page. Experimental results show 3.3 ∼ 47.5 times faster page update time with one overwrite allowance and 1.3 ∼ 18.7 with four overwrites all...
متن کاملAn Efficient Dynamic Hash Index Structure for NAND Flash Memory
We propose an efficient dynamic hash index structure suitable for a NAND flash memory environment. Since write operations incur significant overhead in NAND flash memory, our design of index structure focuses on minimizing the number of write operations for hash index updates. Through a set of extensive experiments, we show the effectiveness of the proposed hash index structure in a NAND flash ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2020
ISSN: 2079-9292
DOI: 10.3390/electronics9122172